Denoising Using Projection Onto Convex Sets (POCS) Based Framework
نویسندگان
چکیده
Two new optimization techniques based on projections onto convex space (POCS) framework for solving convex optimization problems are presented. The dimension of the minimization problem is lifted by one and sets corresponding to the cost function are defined. If the cost function is a convex function in R the corresponding set is also a convex set in R. The iterative optimization approach starts with an arbitrary initial estimate in R and an orthogonal projection is performed onto one of the sets in a sequential manner at each step of the optimization problem. The method provides globally optimal solutions in total-variation (TV), filtered variation (FV), `1, and entropic cost functions. A new denoising algorithm using the TV framework is developed. The new algorithm does not require any of the regularization parameter adjustment. Simulation examples are presented.
منابع مشابه
Projection Onto Convex Sets ( POCS ) Based Signal Reconstruction Framework with an associated cost function
A new signal processing framework based on the projections onto convex sets (POCS) is developed for solving convex optimization problems. The dimension of the minimization problem is lifted by one and the convex sets corresponding to the epigraph of the cost function are defined. If the cost function is a convex function in RN the corresponding epigraph set is also a convex set in RN+1. The ite...
متن کاملFast alternating projection methods for constrained tomographic reconstruction
The alternating projection algorithms are easy to implement and effective for large-scale complex optimization problems, such as constrained reconstruction of X-ray computed tomography (CT). A typical method is to use projection onto convex sets (POCS) for data fidelity, nonnegative constraints combined with total variation (TV) minimization (so called TV-POCS) for sparse-view CT reconstruction...
متن کاملFractal Image Coding as Projections Onto Convex Sets
We show how fractal image coding can be viewed and generalized in terms of the method of projections onto convex sets (POCS). In this approach, the fractal code defines a set of spatial domain similarity constraints. We also show how such a reformulation in terms of POCS allows additional contraints to be imposed during fractal image decoding. Two applications are presented: image construction ...
متن کاملSignal Reconstruction Framework Based On Projections Onto Epigraph Set Of A Convex Cost Function (PESC)
A new signal processing framework based on the projections onto convex sets (POCS) is developed for solving convex optimization problems. The dimension of the minimization problem is lifted by one and the convex sets corresponding to the epigraph of the cost function are defined. If the cost function is a convex function in RN the corresponding epigraph set is also a convex set in RN+1. The ite...
متن کاملConvex set theoretic image recovery by extrapolated iterations of parallel subgradient projections
Solving a convex set theoretic image recovery problem amounts to finding a point in the intersection of closed and convex sets in a Hilbert space. The projection onto convex sets (POCS) algorithm, in which an initial estimate is sequentially projected onto the individual sets according to a periodic schedule, has been the most prevalent tool to solve such problems. Nonetheless, POCS has several...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1309.0700 شماره
صفحات -
تاریخ انتشار 2013